On the adjacent vertex - distinguishing edge chromatic number of wm wn 的邻强边色数
On adjacent vertex - distinguishing total colorings of graphs pm 215 ; pn 的邻点可区别全染色
The adjacent vertex - distinguishing total coloring of special graphs 几类特殊图的邻点可区别全染色
On adjacent vertex - distinguishing total coloring of three special graphs 三类特殊图的邻点可区别全染色
The adjacent vertex - distinguishing total coloring of some classes of graphs 几类图的相邻顶点可区别的全染色
Some new results on the adjacent vertex - distinguishing total coloring of graphs 关于邻点可区别全染色的几个新结果
A note on the upper bound of adjacent vertex distinguishing chromatic number of graphs 关于图邻点可区别上界的一点注
Also the computation complexity is rather low . thirdly , we proposed two algorithms for 3d mesh models compression using vector quantization : one scheme is based on an extended codebook , with which the correlations between indices of adjacent vertices are adopted and 基于目前大多数可逆水印算法针对原始域媒体的不足,结合矢量量化的思想,提出了一种压缩域三维网格可逆数字水印算法:该算法通过改变矢量量化压缩过程的矢量预测方式来嵌入水印信息,使水印对于信道噪声引起的